Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
نویسندگان
چکیده
منابع مشابه
SkipTree: A Scalable Range-Queryable Distributed Data Structure for Multidimensional Data
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range queries as well as single point queries which are routed in O(log n) hops. SkipTree is fully decentralized with each node being connected to O(log n) other nodes. The memory usage for maintaining the links at each node is ...
متن کاملMultidimensional Data Structures and Techniques for Efficient Decision Making
In this paper we present several novel efficient techniques and multidimensional data structures which can improve the decision making process in many domains. We consider online range aggregation, range selection and range weighted median queries; for most of them, the presented data structures and techniques can provide answers in polylogarithmic time. The presented results have applications ...
متن کاملOptimizing locomotive body structures using imperialist competitive algorithm
In today's design, system complexity and increasing demand for safer, more efficient and less costly systems have created new challenges in science and engineering. Locomotives are products which are designed according to market order and technical needs of customers. Accordingly, targets of companies, especially designers and manufacturers of locomotives, have always been on the path of progre...
متن کاملStudy of Scalable Declustering Algorithms for Parallel Grid Files
Efficient storage and retrieval of large multidimensional datasets is an important concern for large-scale scientific computations such as long-running time-dependent simulations which periodically generate snapshots of the state. The main challenge for efficiently handling such datasets is to minimize response time for multidimensional range queries. The grid file is one of the well known acce...
متن کاملAdvanced Indexing Techniques for Achieving Concurrency in Multidimensional Data Sets
In multidimensional datasets concurrent accesses to data via indexing structures introduce the problem protecting ranges specified in the retrieval from phantom insertions and deletions. This paper proposes a novel approach for concurrency in multidimensional datasets using Advanced Indexing Technique like generalized search tree, R tree and its variants, constitutes an efficient and sound conc...
متن کامل